Stability and Deferred Acceptance: Strategic Behavior in Two-Sided Matching
نویسنده
چکیده
When matching mechanisms yield assignments that are not stable, offers unravel, and, eventually, participants abandon the match. This logic is thought to provide a reasonable explanation of why, empirically, the stable Deferred Acceptance (DA) mechanism persists where non-stable alternatives, such as Priority mechanisms, are abandoned. Theory, however, tells us that both Deferred Acceptance (DA) and Priority mechanisms can yield unstable matches in incomplete information equilibrium. If, however, under DA, match participants deviate from equilibrium by truthfully revealing, then the empirical difference between DA and Priority can be explained. In an experiment, we find evidence that, while participants are able to learn to deviate from truth-telling under a Priority mechanism, they fail to do so under DA. This implies that out-ofequilibrium truth-telling might help to explain why DA persists in spite of being unstable in equilibrium. JEL: C78, C92, D02
منابع مشابه
Stable matching mechanisms are not obviously strategy-proof
Many two-sided matching markets, from labor markets to school choice programs, use a clearinghouse based on the applicant-proposing deferred acceptance algorithm, which is well known to be strategy-proof for the applicants. Nonetheless, a growing amount of empirical evidence reveals that applicants misrepresent their preferences when this mechanism is used. This paper shows that no mechanism th...
متن کاملOn the Susceptibility of the Deferred Acceptance Algorithm
The Deferred Acceptance Algorithm (DAA) is the most widely accepted and used algorithm to match students, workers, or residents to colleges, firms or hospitals respectively. In this paper, we consider for the first time, the complexity of manipulating DAA by agents such as colleges that have capacity more than one. For such agents, truncation is not an exhaustive strategy. We present efficient ...
متن کاملInstability of matchings in decentralized markets with various preference structures
In any two-sided matching market, a stable matching can be found by a central agency using the deferred acceptance procedure of Gale and Shapley. But if the market is decentralized and information is incomplete then stability of the ensuing matching is not to be expected. Despite the prevalence of such matching situations, and the importance of stability, little theory exists concerning instabi...
متن کاملTruncation strategies in two-sided matching markets: Theory and experiment
We investigate strategic behavior in a centralized matching clearinghouse based on the GaleShapley deferred acceptance algorithm. To do so, we conduct a laboratory experiment to test whether agents strategically misrepresent their preferences by submitting a “truncation” of their true preferences. Our experimental design uses a restricted environment in which subjects always have a best-respons...
متن کاملTwo-sided matching with indifferences
Most of the two-sided matching literature maintains the assumption that agents are never indifferent between any two members of the opposite side. In practice, however, ties in preferences arise naturally and are widespread. Market design needs to handle ties carefully, because in the presence of indifferences, stability no longer implies Pareto efficiency, and the deferred acceptance algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010